Robust set operations on polyhedral solids
نویسندگان
چکیده
منابع مشابه
Performance Analysis of a Polyhedral Boolean Set Operations Algorithm
In performing regularized set. operations on two solids, the most difficult step is boundary classification, in which the boundaries of each solid are split into portions that are inside, outside, or on the surface of the other solid. In this paper, we present a method for doing boundary classification on polyhedral solids and give measurements of the algorithm's time complexity on a number of ...
متن کاملRobust portfolio selection with polyhedral ambiguous inputs
Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...
متن کاملBoolean operations on arbitrary polyhedral meshes
A floating-point arithmetic algorithm designed for solving usual boolean operations (intersection, union, and difference) on arbitrary polyhedral meshes is described in this paper. It can be used in many preand post-processing applications in computational physics (e.g. cut-cell volume mesh generation or high order conservative remapping). The method provides conformal polyhedral meshes upon ex...
متن کاملA topologically robust algorithm for Boolean operations on polyhedral shapes using approximate arithmetic
We present a topologically robust algorithm for Boolean operations on polyhedral boundary models. The algorithm can be proved always to generate a result with valid connectivity if the input shape representations have valid connectivity, irrespective of the type of arithmetic used or the extent of numerical errors in the computations or input data. The main part of the algorithm is based on a s...
متن کاملRobust Polyhedral Regularization
In this paper, we establish robustness to noise perturbations of polyhedral regularization of linear inverse problems. We provide a sufficient condition that ensures that the polyhedral face associated to the true vector is equal to that of the recovered one. This criterion also implies that the l2 recovery error is proportional to the noise level for a range of parameter. Our criterion is expr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Computer Graphics and Applications
سال: 1989
ISSN: 0272-1716
DOI: 10.1109/38.41469